depth-first search - definição. O que é depth-first search. Significado, conceito
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

O que (quem) é depth-first search - definição

SEARCH ALGORITHM
Depth first search; Depth-first; DFS algorithm; Depth-first traversal; Depth-First Search; Back edge; Forward edge; Depth First Search; Applications of depth-first search
  • Animated example of a depth-first search
  • Order in which the nodes get expanded
  • The example graph, copied from above
  • alt=A directed graph with edges AB, BD, AC, CD
  • Randomized algorithm similar to depth-first search used in generating a maze.
  • The four types of edges defined by a spanning tree

depth-first search         
<algorithm> A graph search algorithm which extends the current path as far as possible before backtracking to the last choice point and trying the next alternative path. Depth-first search may fail to find a solution if it enters a cycle in the graph. This can be avoided if we never extend a path to a node which it already contains. Opposite of breadth first search. See also {iterative deepening}. (1995-04-19)
Depth-first search         
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
breadth-first search         
  • BFS on [[Maze-solving algorithm]]
  • Top part of [[Tic-tac-toe]] game tree
ALGORITHM FOR SEARCHING THE NODES OF A GRAPH IN ORDER BY THEIR HOP COUNT FROM A STARTING NODE
Breadth first search; Breadth first recursion; Breadth-first traversal; BFS algorithm; Breadth-first; Breath first search; Breath-first search; Breadth-First Search; Applications of breadth-first search
<algorithm> A graph search algorithm which tries all one-step extensions of current paths before trying larger extensions. This requires all current paths to be kept in memory simultaneously, or at least their end points. Opposite of depth-first search. See also {best first search}. (1996-01-05)

Wikipédia

Depth-first search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.

A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.